Steiner Tree 1.39-Approximation in Practice
نویسندگان
چکیده
We consider the currently strongest Steiner tree approximation algorithm that has recently been published by Goemans, Olver, Rothvoß and Zenklusen (2012). It first solves a hypergraphic LP relaxation and then applies matroid theory to obtain an integral solution. The cost of the resulting Steiner tree is at most (1.39 + ε)-times the cost of an optimal Steiner tree where ε tends to zero as some parameter k tends to infinity. However, the degree of the polynomial running time depends on this constant k, so only small k are tractable in practice. The algorithm has, to our knowledge, not been implemented and evaluated in practice before. We investigate different implementation aspects and parameter choices of the algorithm and compare tuned variants to an exact LP-based algorithm as well as to fast and simple 2-approximations.
منابع مشابه
Approximation Algorithms for Steiner Tree Problems Based on Universal Solution Frameworks
This paper summarizes the work on implementing few solutions for the Steiner Tree problem which we undertook in the PAAL project. The main focus of the project is the development of generic implementations of approximation algorithms together with universal solution frameworks. In particular, we have implemented Zelikovsky 11/6approximation using local search framework, and 1.39-approximation b...
متن کاملIntegrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound
Recently, Byrka, Grandoni, Rothvoß and Sanità gave a 1.39-approximation for the Steiner tree problem, using a hypergraph-based linear programming relaxation. They also upper-bounded its integrality gap by 1.55. We describe a shorter proof of the same integrality gap bound, by applying some of their techniques to a randomized loss-contracting algorithm.
متن کاملContraction-Based Steiner Tree Approximations in Practice
In this experimental study we consider contraction-based Steiner tree approximations. This class contains the only approximation algorithms that guarantee a constant approximation ratio below 2 and still may be applicable in practice. Despite their vivid evolution in theory, these algorithms have, to our knowledge, never been thoroughly investigated in practice before, which is particularly int...
متن کاملCombinatorial 6/5-Approximation of Steiner Tree
The Steiner tree problem is one of the most fundamental and intensively studied NP-hard problems. There have been improved approximation algorithms for this problem starting from the naive 2-approximation algorithm and resulting in the best combinatorial approximation with ratio 1+ ln(3) 2 + ǫ < 1.55 [33]. An LP-based approximation algorithm, and in particular an integrality gap smaller than 2 ...
متن کاملStrong Steiner Tree Approximations in Practice
In this experimental study we consider Steiner tree approximations that guarantee a constant approximation of ratio less than 2. The considered greedy algorithms and approaches based on linear programming involve the incorporation of k-restricted full components for some k ≥ 3. For most of the algorithms, their strongest theoretical approximation bounds are only achieved for k →∞. However, the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014